The Lessons of Flowshop Scheduling Research
نویسندگان
چکیده
منابع مشابه
Six Decades of Flowshop Scheduling Research
In the field of scheduling, the flowshop problems have been thoroughly studied over the last six decades. In this paper we propose a concise overview of flowshop scheduling techniques evolved during this period. We surveyed the exact, heuristics and metaheuristics methods for solving various flowshop scheduling problems. As a result various optimization techniques, solution procedures are avail...
متن کاملAppling Metaheuristic Algorithms on a Two Stage Hybrid Flowshop Scheduling Problem with Serial Batching (RESEARCH NOTE)
In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...
متن کاملOn Solving Flowshop Scheduling Problems
This paper proposes two variants of heuristic algorithms to solve the classic permutation flowshop scheduling problem. Both algorithms are simple and very efficient. The first algorithm is a constructive heuristic which builds the optimal schedule of jobs on the basis of a selective-greedy process. To escape the trap of local optimum points, for the second heuristic algorithm a stochastic featu...
متن کاملFlexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملThe distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of identical factories or shops, each one with machines disposed in series. A set of n available jobs have to be distributed among the factories and then ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1992
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.40.1.7